Rewriting semantics of production rule sets

Rewriting semantics of production rule sets

This paper is about the semantics of production rule sets, a language used to model asynchronous digital circuits. Two formal semantics are developed and proved equivalent: a set-theoretic semantics that improves upon an earlier effort of ours, and an executable semantics in rewriting logic. The set-theoretic semantics is especially suited to meta-level proofs about production rule sets, wherea...

Declarative Semantics for the Rule Interchange Format Production Rule Dialect

The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operationally via labeled terminal transition systems. In this paper, we introduce a declarative logical characterization of the full default semantics of RIF-PRD based on Answer Set Programming (ASP), including matching, conflict resol...

Semantics-Preserving Simplification of Real-World Firewall Rule Sets

The security provided by a firewall for a computer network almost completely depends on the rules it enforces. For over a decade, it has been a well-known and unsolved problem that the quality of many firewall rule sets is insufficient. Therefore, there are many tools to analyze them. However, we found that none of the available tools could handle typical, real-world iptables rulesets. This is ...

Transfinite Rewriting Semantics for Term Rewriting Systems

We provide some new results concerning the use of trans-nite rewriting for giving semantics to rewrite systems. We especially (but not only) consider the computation of possibly innnite constructor terms by transsnite rewriting due to their interest in many programming languages. We reconsider the problem of compressing transsnite rewrite sequences into shorter (possibly nite) ones. We also inv...

Modular Rewriting Semantics in Practice